منابع مشابه
Minimization Over Boolean Graphs
This paper presents a systematic procedure for the design of gate-type combinational switchingcircuitswithoutdiredtedloops. Eachsuchcircuit(Boo1eangraph) is in correspondencewithasequence of decompositions of the Boolean function which it realizes. A general approach to functional decomposition i s given and, in terms of a convenient positional representation, efficient tests for the detection ...
متن کاملBoolean-Width of Graphs
We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is the runtime bottleneck when using a divide-and-conquer approach. Boolean-width is similar to rank-width, which is related to the number of GF [2]-sums (1+1=0) of neighborhoods instead of the Boolean-sums (1+1=1) used for boole...
متن کاملBoolean complexes for Ferrers graphs
In this paper we provide an explicit formula for calculating the boolean number of a Ferrers graph. By previous work of the last two authors, this determines the homotopy type of the boolean complex of the graph. Specializing to staircase shapes, we show that the boolean numbers of the associated Ferrers graphs are the Genocchi numbers of the second kind, and obtain a relation between the Legen...
متن کاملQDI Implementations of Boolean Graphs
Implementing combinational logic efficiently in QDI designs is hard, due to the need to acknowledge every transition, and naive approaches are often used. The paper demonstrates the problem of using Delay-Insensitive Minterm Synthesis on anything but the smallest designs.These problems can be overcome by employing techniques from MultiLevel Logic synthesis. An initial method using Roth-Karp dec...
متن کاملSome Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2018
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927872.2018.1448839